منابع مشابه
Packing paths in digraphs
Let G be a xed collection of digraphs. Given a digraph H, a Gpacking of H is a collection of vertex disjoint subgraphs of H, each isomorphic to a member of G. A G-packing, P, is maximum if the number of vertices belonging to some member of P is maximum, over all G-packings. The analogous problem for undirected graphs has been extensively studied in the literature. We concentrate on the cases wh...
متن کاملPacking Non-Returning A-Paths
Chudnovsky et al. gave a min-max formula for the maximum number of node-disjoint non-zero A-paths in group-labeled graphs [1], which is a generalization of Mader’s theorem on node-disjoint A-paths [3]. Here we present a further generalization with a shorter proof. The main feature of Theorem 2.1 is that parity is “hidden” inside ν̂, which is given by an oracle for non-bipartite matching.
متن کاملPacking paths of length at least two
We give a simple proof for Kaneko’s theorem which gives a su2cient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path system. c © 2004 Elsevier B.V. All righ...
متن کاملPacking non-returning A-paths algorithmically
In this paper we present an algorithmic approach to packing A-paths. It is regarded as a generalization of Edmonds’ matching algorithm, however there is the significant difference that here we do not build up any kind of alternating tree. Instead we use the so-called 3-way lemma, which either provides augmentation, or a dual, or a subgraph which can be used for contraction. The method works in ...
متن کاملA note on packing paths in planar graphs
P.D. Seymour proved that the cut criterion is necessary and suucient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, M. Middendorf and F. Pfeiier proved the problem to be NP-complete. For this case E. Korach and M. Penn proved that the cut criterion is suucient for the existen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90382-r